Sparse Constrained Low Tensor Rank Representation Framework for Hyperspectral Unmixing

نویسندگان

چکیده

Recently, non-negative tensor factorization (NTF) as a very powerful tool has attracted the attention of researchers. It is used in unmixing hyperspectral images (HSI) due to its excellent expression ability without any information loss when describing data. However, most existing methods based on NTF fail fully explore unique properties data, for example, low rank, that exists both spectral and spatial domains. To this low-rank structure, paper we learn different representations HSI spectral, non-local similarity modes. Firstly, divided into many patches, these patches are clustered multiple groups according similarity. Each group can constitute 4-D tensor, including two modes, mode mode, which strong properties. Secondly, regularization with logarithmic function designed embedded framework, simulates spatial, modes tensors. In addition, sparsity abundance also integrated framework improve performance through L2,1 norm. Experiments three real data sets illustrate stability effectiveness our algorithm compared five state-of-the-art methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Low-rank Tensor Regularization Strategy for Hyperspectral Unmixing

Tensor-based methods have recently emerged as a more natural and effective formulation to address many problems in hyperspectral imaging. In hyperspectral unmixing (HU), low-rank constraints on the abundance maps have been shown to act as a regularization which adequately accounts for the multidimensional structure of the underlying signal. However, imposing a strict low-rank constraint for the...

متن کامل

Sparse Hyperspectral Unmixing

Given a set of mixed spectral vectors, spectral mixture analysis (or spectral unmixing) aims at estimating the number of reference materials, also called endmembers, their spectral signatures, and their fractional abundances. A semi-supervised approach to deal with the linear spectral unmixing problem consists in assuming that the observed spectral vectors are linear combinations of a small num...

متن کامل

Hyperspectral Unmixing via Low-Rank Representation with Space Consistency Constraint and Spectral Library Pruning

Spectral unmixing is a popular technique for hyperspectral data interpretation. It focuses on estimating the abundance of pure spectral signature (called as endmembers) in each observed image signature. However, the identification of the endmembers in the original hyperspectral data becomes a challenge due to the lack of pure pixels in the scenes and the difficulty in estimating the number of e...

متن کامل

Structured Sparse Method for Hyperspectral Unmixing

Hyperspectral Unmixing (HU) has received increasing attention in the past decades due to its ability of unveiling information latent in hyperspectral data. Unfortunately, most existing methods fail to take advantage of the spatial information in data. To overcome this limitation, we propose a Structured Sparse regularized Nonnegative Matrix Factorization (SS-NMF) method from the following two a...

متن کامل

Sparse and Low-Rank Tensor Decomposition

Motivated by the problem of robust factorization of a low-rank tensor, we study the question of sparse and low-rank tensor decomposition. We present an efficient computational algorithm that modifies Leurgans’ algoirthm for tensor factorization. Our method relies on a reduction of the problem to sparse and low-rank matrix decomposition via the notion of tensor contraction. We use well-understoo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Remote Sensing

سال: 2021

ISSN: ['2315-4632', '2315-4675']

DOI: https://doi.org/10.3390/rs13081473